TSTP Solution File: SET621^5 by Leo-III-SAT---1.7.10
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.10
% Problem : SET621^5 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n021.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 7 10:50:09 EDT 2024
% Result : Theorem 5.25s 2.52s
% Output : Refutation 5.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 7
% Syntax : Number of formulae : 52 ( 13 unt; 6 typ; 0 def)
% Number of atoms : 199 ( 17 equ; 0 cnn)
% Maximal formula atoms : 11 ( 4 avg)
% Number of connectives : 434 ( 102 ~; 105 |; 47 &; 180 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 12 ( 12 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 19 ( 10 ^ 9 !; 0 ?; 19 :)
% Comments :
%------------------------------------------------------------------------------
thf(a_type,type,
a: $tType ).
thf(sk1_type,type,
sk1: a > $o ).
thf(sk2_type,type,
sk2: a > $o ).
thf(sk3_type,type,
sk3: a > $o ).
thf(sk4_type,type,
sk4: a ).
thf(sk5_type,type,
sk5: $o ).
thf(1,conjecture,
! [A: a > $o,B: a > $o,C: a > $o] :
( ( ^ [D: a] :
( ( ( ( A @ D )
& ~ ( B @ D ) )
| ( ( B @ D )
& ~ ( A @ D ) ) )
& ~ ( C @ D ) ) )
= ( ^ [D: a] :
( ( ( A @ D )
& ~ ( ( B @ D )
| ( C @ D ) ) )
| ( ( B @ D )
& ~ ( ( A @ D )
| ( C @ D ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cBOOL_PROP_97_pme) ).
thf(2,negated_conjecture,
~ ! [A: a > $o,B: a > $o,C: a > $o] :
( ( ^ [D: a] :
( ( ( ( A @ D )
& ~ ( B @ D ) )
| ( ( B @ D )
& ~ ( A @ D ) ) )
& ~ ( C @ D ) ) )
= ( ^ [D: a] :
( ( ( A @ D )
& ~ ( ( B @ D )
| ( C @ D ) ) )
| ( ( B @ D )
& ~ ( ( A @ D )
| ( C @ D ) ) ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ! [A: a > $o,B: a > $o,C: a > $o] :
( ( ^ [D: a] :
( ( ( ( A @ D )
& ~ ( B @ D ) )
| ( ( B @ D )
& ~ ( A @ D ) ) )
& ~ ( C @ D ) ) )
= ( ^ [D: a] :
( ( ( A @ D )
& ~ ( ( B @ D )
| ( C @ D ) ) )
| ( ( B @ D )
& ~ ( ( A @ D )
| ( C @ D ) ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
( ( ^ [A: a] :
( ( ( ( sk1 @ A )
& ~ ( sk2 @ A ) )
| ( ( sk2 @ A )
& ~ ( sk1 @ A ) ) )
& ~ ( sk3 @ A ) ) )
!= ( ^ [A: a] :
( ( ( sk1 @ A )
& ~ ( ( sk2 @ A )
| ( sk3 @ A ) ) )
| ( ( sk2 @ A )
& ~ ( ( sk1 @ A )
| ( sk3 @ A ) ) ) ) ) ),
inference(cnf,[status(esa)],[3]) ).
thf(5,plain,
( ( ^ [A: a] :
( ( ( ( sk1 @ A )
& ~ ( sk2 @ A ) )
| ( ( sk2 @ A )
& ~ ( sk1 @ A ) ) )
& ~ ( sk3 @ A ) ) )
!= ( ^ [A: a] :
( ( ( sk1 @ A )
& ~ ( ( sk2 @ A )
| ( sk3 @ A ) ) )
| ( ( sk2 @ A )
& ~ ( ( sk1 @ A )
| ( sk3 @ A ) ) ) ) ) ),
inference(lifteq,[status(thm)],[4]) ).
thf(6,plain,
( ( ( ( ( sk1 @ sk4 )
& ~ ( sk2 @ sk4 ) )
| ( ( sk2 @ sk4 )
& ~ ( sk1 @ sk4 ) ) )
& ~ ( sk3 @ sk4 ) )
!= ( ( ( sk1 @ sk4 )
& ~ ( ( sk2 @ sk4 )
| ( sk3 @ sk4 ) ) )
| ( ( sk2 @ sk4 )
& ~ ( ( sk1 @ sk4 )
| ( sk3 @ sk4 ) ) ) ) ),
inference(func_ext,[status(esa)],[5]) ).
thf(8,plain,
( ( ( ( ( sk1 @ sk4 )
& ~ ( sk2 @ sk4 ) )
| ( ( sk2 @ sk4 )
& ~ ( sk1 @ sk4 ) ) )
& ~ ( sk3 @ sk4 ) )
| ( ( sk1 @ sk4 )
& ~ ( ( sk2 @ sk4 )
| ( sk3 @ sk4 ) ) )
| ( ( sk2 @ sk4 )
& ~ ( ( sk1 @ sk4 )
| ( sk3 @ sk4 ) ) ) ),
inference(bool_ext,[status(thm)],[6]) ).
thf(15,plain,
( ~ sk5
| ( sk2 @ sk4 )
| ( sk1 @ sk4 )
| ( sk2 @ sk4 ) ),
inference(cnf,[status(esa)],[8]) ).
thf(42,plain,
( ~ sk5
| ( sk2 @ sk4 )
| ( sk1 @ sk4 ) ),
inference(simp,[status(thm)],[15]) ).
thf(7,plain,
( ~ ( ( ( ( sk1 @ sk4 )
& ~ ( sk2 @ sk4 ) )
| ( ( sk2 @ sk4 )
& ~ ( sk1 @ sk4 ) ) )
& ~ ( sk3 @ sk4 ) )
| ~ ( ( ( sk1 @ sk4 )
& ~ ( ( sk2 @ sk4 )
| ( sk3 @ sk4 ) ) )
| ( ( sk2 @ sk4 )
& ~ ( ( sk1 @ sk4 )
| ( sk3 @ sk4 ) ) ) ) ),
inference(bool_ext,[status(thm)],[6]) ).
thf(9,plain,
( ~ ( sk2 @ sk4 )
| ( sk1 @ sk4 )
| ( sk3 @ sk4 )
| ~ ( sk2 @ sk4 )
| ( sk1 @ sk4 )
| ( sk3 @ sk4 ) ),
inference(cnf,[status(esa)],[7]) ).
thf(12,plain,
( ~ ( sk2 @ sk4 )
| ( sk1 @ sk4 )
| ( sk3 @ sk4 ) ),
inference(simp,[status(thm)],[9]) ).
thf(30,plain,
( ~ sk5
| ~ ( sk3 @ sk4 )
| ~ ( sk3 @ sk4 ) ),
inference(cnf,[status(esa)],[8]) ).
thf(50,plain,
( ~ sk5
| ~ ( sk3 @ sk4 ) ),
inference(simp,[status(thm)],[30]) ).
thf(63,plain,
( ~ ( sk2 @ sk4 )
| ( sk1 @ sk4 )
| ~ sk5
| ( ( sk3 @ sk4 )
!= ( sk3 @ sk4 ) ) ),
inference(paramod_ordered,[status(thm)],[12,50]) ).
thf(64,plain,
( ~ ( sk2 @ sk4 )
| ( sk1 @ sk4 )
| ~ sk5 ),
inference(pattern_uni,[status(thm)],[63:[]]) ).
thf(237,plain,
( ~ sk5
| ( sk1 @ sk4 )
| ( ( sk2 @ sk4 )
!= ( sk2 @ sk4 ) ) ),
inference(paramod_ordered,[status(thm)],[42,64]) ).
thf(238,plain,
( ~ sk5
| ( sk1 @ sk4 ) ),
inference(pattern_uni,[status(thm)],[237:[]]) ).
thf(35,plain,
( ( sk1 @ sk4 )
| sk5
| ( sk1 @ sk4 )
| ( sk2 @ sk4 ) ),
inference(cnf,[status(esa)],[8]) ).
thf(41,plain,
( ( sk1 @ sk4 )
| sk5
| ( sk2 @ sk4 ) ),
inference(simp,[status(thm)],[35]) ).
thf(59,plain,
( ( sk1 @ sk4 )
| sk5
| ( sk3 @ sk4 )
| ( ( sk2 @ sk4 )
!= ( sk2 @ sk4 ) ) ),
inference(paramod_ordered,[status(thm)],[41,12]) ).
thf(60,plain,
( ( sk1 @ sk4 )
| sk5
| ( sk3 @ sk4 ) ),
inference(pattern_uni,[status(thm)],[59:[]]) ).
thf(31,plain,
( ~ ( sk3 @ sk4 )
| sk5
| ~ ( sk3 @ sk4 ) ),
inference(cnf,[status(esa)],[8]) ).
thf(48,plain,
( ~ ( sk3 @ sk4 )
| sk5 ),
inference(simp,[status(thm)],[31]) ).
thf(82,plain,
( ( sk1 @ sk4 )
| sk5
| ( ( sk3 @ sk4 )
!= ( sk3 @ sk4 ) ) ),
inference(paramod_ordered,[status(thm)],[60,48]) ).
thf(83,plain,
( ( sk1 @ sk4 )
| sk5 ),
inference(pattern_uni,[status(thm)],[82:[]]) ).
thf(11,plain,
( ~ ( sk1 @ sk4 )
| ( sk2 @ sk4 )
| ( sk3 @ sk4 )
| ~ ( sk1 @ sk4 )
| ( sk2 @ sk4 )
| ( sk3 @ sk4 ) ),
inference(cnf,[status(esa)],[7]) ).
thf(14,plain,
( ~ ( sk1 @ sk4 )
| ( sk2 @ sk4 )
| ( sk3 @ sk4 ) ),
inference(simp,[status(thm)],[11]) ).
thf(110,plain,
( sk5
| ( sk2 @ sk4 )
| ( sk3 @ sk4 )
| ( ( sk1 @ sk4 )
!= ( sk1 @ sk4 ) ) ),
inference(paramod_ordered,[status(thm)],[83,14]) ).
thf(111,plain,
( sk5
| ( sk2 @ sk4 )
| ( sk3 @ sk4 ) ),
inference(pattern_uni,[status(thm)],[110:[]]) ).
thf(247,plain,
( sk5
| ( sk2 @ sk4 )
| ( ( sk3 @ sk4 )
!= ( sk3 @ sk4 ) ) ),
inference(paramod_ordered,[status(thm)],[111,48]) ).
thf(248,plain,
( sk5
| ( sk2 @ sk4 ) ),
inference(pattern_uni,[status(thm)],[247:[]]) ).
thf(16,plain,
( ~ ( sk2 @ sk4 )
| sk5
| ~ ( sk2 @ sk4 )
| ~ ( sk1 @ sk4 ) ),
inference(cnf,[status(esa)],[8]) ).
thf(47,plain,
( ~ ( sk2 @ sk4 )
| sk5
| ~ ( sk1 @ sk4 ) ),
inference(simp,[status(thm)],[16]) ).
thf(100,plain,
( sk5
| ~ ( sk2 @ sk4 )
| ( ( sk1 @ sk4 )
!= ( sk1 @ sk4 ) ) ),
inference(paramod_ordered,[status(thm)],[83,47]) ).
thf(101,plain,
( sk5
| ~ ( sk2 @ sk4 ) ),
inference(pattern_uni,[status(thm)],[100:[]]) ).
thf(287,plain,
( sk5
| ( ( sk2 @ sk4 )
!= ( sk2 @ sk4 ) ) ),
inference(paramod_ordered,[status(thm)],[248,101]) ).
thf(288,plain,
sk5,
inference(pattern_uni,[status(thm)],[287:[]]) ).
thf(317,plain,
( ~ $true
| ( sk1 @ sk4 ) ),
inference(rewrite,[status(thm)],[238,288]) ).
thf(318,plain,
sk1 @ sk4,
inference(simp,[status(thm)],[317]) ).
thf(323,plain,
( ( ( ( $true
& ~ ( sk2 @ sk4 ) )
| ( ( sk2 @ sk4 )
& ~ $true ) )
& ~ ( sk3 @ sk4 ) )
!= ( ( $true
& ~ ( ( sk2 @ sk4 )
| ( sk3 @ sk4 ) ) )
| ( ( sk2 @ sk4 )
& ~ ( $true
| ( sk3 @ sk4 ) ) ) ) ),
inference(rewrite,[status(thm)],[6,318]) ).
thf(324,plain,
( ( ~ ( sk2 @ sk4 )
& ~ ( sk3 @ sk4 ) )
!= ( ~ ( ( sk2 @ sk4 )
| ( sk3 @ sk4 ) ) ) ),
inference(simp,[status(thm)],[323]) ).
thf(319,plain,
( ~ $true
| ~ ( sk3 @ sk4 ) ),
inference(rewrite,[status(thm)],[50,288]) ).
thf(320,plain,
~ ( sk3 @ sk4 ),
inference(simp,[status(thm)],[319]) ).
thf(327,plain,
( ( ~ ( sk2 @ sk4 )
& ~ $false )
!= ( ~ ( ( sk2 @ sk4 )
| $false ) ) ),
inference(rewrite,[status(thm)],[324,320]) ).
thf(328,plain,
$false,
inference(simp,[status(thm)],[327]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10 % Problem : SET621^5 : TPTP v8.1.2. Released v4.0.0.
% 0.06/0.12 % Command : run_Leo-III %s %d
% 0.12/0.33 % Computer : n021.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon May 6 20:51:09 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.91/0.92 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.30/1.09 % [INFO] Parsing done (165ms).
% 1.30/1.10 % [INFO] Running in sequential loop mode.
% 1.71/1.42 % [INFO] nitpick registered as external prover.
% 1.71/1.43 % [INFO] Scanning for conjecture ...
% 1.97/1.49 % [INFO] Found a conjecture and 0 axioms. Running axiom selection ...
% 1.97/1.51 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.97/1.51 % [INFO] Problem is higher-order (TPTP THF).
% 1.97/1.52 % [INFO] Type checking passed.
% 1.97/1.52 % [CONFIG] Using configuration: timeout(300) with strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>. Searching for refutation ...
% 5.25/2.51 % [INFO] Killing All external provers ...
% 5.25/2.51 % Time passed: 2019ms (effective reasoning time: 1406ms)
% 5.25/2.51 % Solved by strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>
% 5.25/2.52 % Axioms used in derivation (0):
% 5.25/2.52 % No. of inferences in proof: 46
% 5.25/2.52 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 2019 ms resp. 1406 ms w/o parsing
% 5.25/2.58 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 5.25/2.58 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------